Pyramid construct with trusted score validation

ABSTRACT

Disclosed herein are systems and methods for decentralized data distribution by a database network system comprising a hierarchical blockchain model. The hierarchical blockchain model may comprise a quantum pyramid consensus to distribute data throughout the database network system in a decentralized and secure manner. The hierarchical construct may be built according to trusted scores calculated for the nodes of the network over their lifetime at the network.

CROSS-REFERENCE

This application claims the benefit of U.S. Provisional Patent App. No.62/943,584, filed Dec. 4, 2019, which is entirely incorporated herein byreference for all purposes.

BACKGROUND

The present disclosure relates generally to decentralized databasenetworks, such as blockchain networks. Provided herein is a databasenetwork system for decentralized data distribution. Methods and systemsmay comprise a hierarchical blockchain model for decentralized datadistribution and security mechanisms for secured data distribution indecentralized networks.

SUMMARY

Recognized herein is a need for systems and methods for secure,efficient, and decentralized data distribution to a plurality of nodes.

In an aspect, the present disclosure provides a database network systemfor decentralized data distribution, comprising: a plurality of nodescommunicating in a hierarchical construct based on a trusted scoreassigned to each node of the plurality of nodes. A node of the pluralityof nodes in the hierarchical construct may be configured to receive adata block from a parent node and distribute the data block to at leasttwo child nodes. The parent node may have a higher trusted score thanthe node and the node may have a higher trusted score than each of theat least two child nodes. The node may be configured to validate thedata block based on one or more trusted scores of one or more nodes inan upstream distribution path of the data block. Each of the pluralityof nodes may comprise a copy of the hierarchical construct.

In some embodiments, the data block may comprise a cryptographic hash ofa previous data block in a blockchain network which may comprise theprevious data block and the data block. The node may be configured tofurther validate the data block based on the cryptographic hash. In someembodiments, the node may be configured to distribute the data block toat most two child nodes.

In some embodiments, the data block may be signed by a user private key.The user private key may be configured for verification by a user publickey. The user public key may be stored on a blockchain network. Eachnode of the plurality of nodes may be configured to verify the userprivate key using the user public key. In some embodiments, the datablock may be signed by an application private key. The applicationprivate key may be configured for verification by an application publickey. The application public key may be stored on the blockchain network,and each node of the plurality of nodes may be configured to verify theapplication private key using the application public key.

In an aspect, the present disclosure provides a database network systemfor decentralized data distribution, comprising: a plurality of nodescommunicating in a dynamic hierarchical construct comprising a top node.A node of the plurality of nodes in the dynamic hierarchical constructmay be configured to receive a data block from a parent node anddistribute the data block to at least two child nodes. The node may beconfigured to validate the data block based on an upstream distributionpath of the data block to the top node. The dynamic hierarchicalconstruct may be configured to change the top node with each data block.Each of the plurality of nodes comprises a copy of the dynamichierarchical construct.

In some embodiments, the dynamic hierarchical construct may be based ona trusted score assigned to each node of the plurality of nodes. Theparent node may have a higher trusted score than the node. The node mayhave a higher trusted score than each of the at least two child nodes.The node may be configured to validate the data block based on one ormore trusted scores of one or more nodes in the upstream distributionpath of the data block.

In some embodiments, the data block may comprise a cryptographic hash ofa previous data block in a blockchain network comprising the previousdata block and the data block. The node may be configured to furthervalidate the data block based on the cryptographic hash. In someembodiments, the node may be configured to distribute the data block toat most two child nodes. In some embodiments, the data block may besigned by a user private key. The user private key may be configured forverification by a user public key. The user public key may be stored ona blockchain network. Each node of the plurality of nodes may beconfigured to verify the user private key using the user public key.

The data block may be signed by an application private key. Theapplication private key may be configured for verification by anapplication public key. The application public key may be stored on theblockchain network, and each node of the plurality of nodes may beconfigured to verify the application private key using the applicationpublic key.

In another aspect, the present disclosure provides a method forconstructing a database network system from a plurality of nodes fordecentralized data distribution, comprising: (a) using a plurality oftests, assaying a computing power of each of the plurality of nodessubstantially simultaneously, where each of the plurality of nodes mayreceive a different test of the plurality of tests; (b) determining atest score for each of the plurality of nodes based at least in part onthe computing power determined in (a); (c) determining a trusted scorefor each of the plurality of nodes, where trusted score may be based atleast in part on a sum of the test score and an accumulated trustedscore for each of the plurality of nodes, if any; and (d) generating ahierarchical construct of the plurality of nodes. A node of theplurality of nodes in the hierarchical construct may be configured toreceive a data block from a parent node and distribute the data block toat least two child nodes. The parent node may have a higher trustedscore than the node and the node may have a higher trusted score thaneach of the at least two child nodes. In some embodiments, the methodmay further comprise repeating (a)-(d). The plurality of tests may becalculated by the plurality of nodes. Two tests of the plurality oftests provided to the at least two child nodes may be calculated by thenode.

In some embodiments, the trusted score for the node may be based atleast in part on a given test score for a child node of the at least twochild nodes. In some embodiments, substantially simultaneously comprisesless than 1 second. In some embodiments, the plurality of tests maycomprise calculation of a total block hash based on random blocknumbers. In some embodiments, the method further comprises distributingthe data block from the parent node to the node, and from the node tothe at least two child nodes.

In some embodiments, the method further comprises validating the datablock, by each of the plurality of nodes, based on one or more trustedscores of one or more nodes in an upstream distribution path of the datablock.

Another aspect of the present disclosure provides a non-transitorycomputer readable medium comprising machine executable code that, uponexecution by one or more computer processors, implements any of themethods above or elsewhere herein.

Another aspect of the present disclosure provides a system comprisingone or more computer processors and computer memory coupled thereto. Thecomputer memory comprises machine executable code that, upon executionby the one or more computer processors, implements any of the methodsabove or elsewhere herein.

Additional aspects and advantages of the present disclosure will becomereadily apparent to those skilled in this art from the followingdetailed description, wherein only illustrative embodiments of thepresent disclosure are shown and described. As will be realized, thepresent disclosure is capable of other and different embodiments, andits several details are capable of modifications in various obviousrespects, all without departing from the disclosure. Accordingly, thedrawings and description are to be regarded as illustrative in nature,and not as restrictive.

INCORPORATION BY REFERENCE

All publications, patents, and patent applications mentioned in thisspecification are herein incorporated by reference to the same extent asif each individual publication, patent, or patent application wasspecifically and individually indicated to be incorporated by reference.To the extent publications and patents or patent applicationsincorporated by reference contradict the disclosure contained in thespecification, the specification is intended to supersede and/or takeprecedence over any such contradictory material.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features of the invention are set forth with particularity inthe appended claims. A better understanding of the features andadvantages of the present invention will be obtained by reference to thefollowing detailed description that sets forth illustrative embodiments,in which the principles of the invention are utilized, and theaccompanying drawings (also “Figure” and “FIG.” herein), of which:

FIG. 1 illustrates an example pyramidal hierarchical construct which maybe used to perform the methods of the present disclosure;

FIG. 2 shows a computer system that is programmed or otherwiseconfigured to implement methods provided herein.

DETAILED DESCRIPTION

While various embodiments of the invention have been shown and describedherein, it will be obvious to those skilled in the art that suchembodiments are provided by way of example only. Numerous variations,changes, and substitutions may occur to those skilled in the art withoutdeparting from the invention. It should be understood that variousalternatives to the embodiments of the invention described herein may beemployed.

Unless otherwise defined, all technical terms used herein have the samemeaning as commonly understood by one of ordinary skill in the art towhich this disclosure belongs.

As used herein, the singular forms “a,” “an,” and “the” include pluralreferences unless the context clearly dictates otherwise. Any referenceto “or” herein is intended to encompass “and/or” unless otherwisestated.

As used herein, the term “real-time” generally refers to transmitting orprocessing data without intentional delay given the processinglimitations of a system, the time required to accurately obtain data,and the rate of change of the data. In some instances, real-time mayrefer to simultaneous or substantially simultaneous occurrence of oneevent relative to another event. In some instances, real-time mayinclude a response time of less than 1 second, tenths of a second,hundredths of a second, a millisecond, or less.

The present disclosure provides a database network system fordecentralized data distribution, and methods thereof. The databasenetwork system may comprise a hierarchical blockchain model.

Blockchain Models

A blockchain model may comprise a growing list of records, such asblocks, that may be linked and secured using cryptography. The databasenetwork system may be a distributed database system which may becollectively maintained by a plurality of nodes in a decentralizedmanner. The network may comprise a series of blocks which may begenerated by, or with aid of, cryptography. The database network systemmay comprise or be an immutable digital public ledger. The databasenetwork system may be a continuously growing, distributed database. Thedistributed database may be cryptographically secured using the methods,procedures, and measures provided herein.

A blockchain may comprise one or more blocks. The one or more blocks maybe associated with a sequence. Each block may contain a hash value of aprevious block, a timestamp, and data (e.g., transaction data). Theblockchain may be formed starting from a genesis block to a currentblock. The blocks may be generated in a chronological order, such that ahash value of the previous block may be known. In some cases, the blocksmay be generated in a linear, chronological order. In some cases, blocksmay be generated in a non-linear order or according to other patterns.The database network system may have substantially complete informationfrom the genesis block to the most recently completed block.

In some cases, the database network system may store informationcomprising data in uniform-sized blocks. Each block may comprise hashedinformation from the previous block to provide cryptographic security.This may also be referred to as data hashing. Data hashing may comprisea hashing function. The hashed data and/or information may comprise thedata and digital signatures, and/or keys (such as public key and/orprivate key) from the previous block, and the hashed information of theprevious blocks that may go all the way back to the genesis block. Theinformation may be distributed through a hash function which may thenpoint to the address of the previous block. In some cases, the databasenetwork system may comprise a linked list that may comprise pointers.Blocks may store information validated by nodes that may becryptographically secured according to the methods described herein.

The genesis block may be where the very first data in the network weregenerated. In some examples, the database network system may be a systemof decentralized transactions and/or a system of decentralized trustlesstransactions. In some cases, the database network system may be adecentralized public ledger. For example, the database network systemmay stand as a trustless proof mechanism of all activities (such astransactions) on the network. Users may trust the system of the publicledger stored on many different decentralized nodes, in some casesworldwide, as opposed to establishing and maintaining trust with acounterparty, such as a transaction counterparty, such as anotherperson, or a third-party intermediary (e.g., a bank).

The database network system may perform as another application layer torun on an existing stack of Internet protocols, adding a new tier to theInternet to enable activities such as performing economic transactions,currency payments such as digital currency payments, registering andmaintaining financial contracts, transacting hard and/or soft assets,and more activities.

Further, the database network system may be used for activities beyondtransactions, such as a registry and/or inventory system for recording,tracking, tracking, monitoring, and/or transacting of all assets. Insome examples, the database network system may be like a ledger forregistering assets, and/or an accounting system for transacting them ona global scale that can comprise all forms of assets held by partiesworldwide. The database network system may be used for any form of assetregistry, inventory, and exchange, comprising every area of finance,economics, money, hard assets (e.g., physical properties), intangibleassets such as votes, ideas, reputation, intention, health data,personal data, media, and more.

In some cases, the database network system may be resistant tomodification of data, or be immutable. The database network system maybe an open and distributed ledger that can record transactions betweentwo or more parties efficiently and in a verifiable way. Transactionsmay be recorded permanently. A blockchain may be managed by a networkcollectively adhering to a protocol (such as an algorithm) forinter-node communication and validation of new blocks. In some cases,once the data is recorded, the data in a given block cannot be alteredretroactively without alteration of all subsequent blocks. Designs maybe optimized such that they facilitate robust workflows whereparticipants' uncertainty regarding data security may be marginal. Theuse of the database network system may remove the characteristic ofinfinite reproducibility from a digital asset. In some cases, it mayconfirm that each unit of value was transferred only once, solving thedouble-spending problem. For example, the transactions may benon-recursive and may not be prone to be repeated once validated in ablock. The database network system may comprise a value-exchangeprotocol. The database network system may be capable of maintainingtitle rights, such that when properly set up to detail the exchangeagreement, it may provide a record that compels offer and acceptance.

In some examples, the database network system may be public.Participants may be allowed to verify and audit transactionsindependently and relatively inexpensively. The database network systemmay be managed autonomously using a network and a distributedtimestamping server. They may be authenticated by mass collaborationpowered by collective self-interest.

Blocks may hold batches of valid transactions that may be hashed andencoded into a structure. Each block may include the cryptographic hashof the prior block in the database network system, which may link them.This process may be performed iteratively (e.g., repetitively,redundantly). The iterative process may confirm the integrity of theprevious block, all the way back to the genesis block.

In some cases, separate blocks may be produced concurrently, creating atemporary fork. In addition to a secure hash-based history, the databasenetwork system may have a specified algorithm for scoring differentversions of the history so that one with a higher score can be selectedover others. Blocks not selected for inclusion in the chain may becalled orphan blocks.

The database network system may comprise a plurality of nodes. A nodemay be an entity, such as a machine (e.g., computer or anotherprocessing device) which is connected to the blockchain network. Amachine may be controlled by a user. A machine may be controlled byanother machine. A node may comprise a computer system describedelsewhere herein. Each node may be capable of performing or configuredto perform the task of validating and relaying transactions in thenetwork. In some instances, each node may have a copy of the networksystem, which in some cases, may be downloaded once a user joins thenetwork. In some cases, the download may be automatic.

The database network system may facilitate decentralized datadistribution. Data may be stored across the entire network. By storingdata across the entire network, the database network system may helpdecrease a number of risks that may otherwise be associated with databeing held centrally, such as in an example centralized network. In somecases, the decentralized database network system may use ad-hoc messagepassing and/or distributed networking. The database network system maylack centralized points of vulnerability that malicious third partiescan exploit; likewise, in some cases, there may be no central point offailure. In some cases, the database network system may be more secureagainst vulnerabilities and external attacks compared to a centralizednetwork. In some cases, the database network system provided herein maybe more secure against external attacks compared to other decentralizednetworks such as other blockchain networks.

Hierarchical Network Constructs

A plurality of nodes in the database network system may communicate witheach other directly or indirectly according to a given or definedstructure, pattern, or construct. The communication of nodes with eachother may facilitate distribution of data between the plurality of nodesthroughout the network. The structure and/or construct may comprise orbe a hierarchical model. A plurality of nodes in the database networksystem may communicate with each other in a hierarchical construct oraccording to a hierarchical construct.

The hierarchical construct may comprise multiple levels, such ashierarchical levels or levels of hierarchy. As used herein, the term“parent” may generally refer to a higher degree of hierarchical levelrelative to a “child” having a lower degree of hierarchical level withina hierarchical construct. In some cases, the hierarchical construct maycomprise or be a binary construct, a pyramid construct, a quantumconstruct, and/or a quantum pyramid binary construct. In some cases,data may be stored in a single database. In some cases, the constructmay be derived from an internal setup of the database. The construct maycomprise or be an exponential structure, such as a tree. A network ofnodes may function according to the hierarchical construct. Thehierarchical construct may define a protocol and/or a distribution pathfor data transmission and/or inter-node communications and validations.

The network of nodes may be structured such that they provide a path fordecentralized data distribution. In some cases, data distribution mayprogress exponentially. Data distribution may be somewhat efficient,efficient, substantially efficient, or highly efficient. In some cases,data distribution may be highly efficient. Data distribution may be moreefficient and faster compared to a blockchain not comprising ahierarchical construct and/or nor comprising a quantum pyramid binaryhierarchical construct such as the one described herein. Thehierarchical model of the present disclosure may facilitate efficient,fast, and secure data distribution throughout the decentralized network.

In some instances, every node in the decentralized network system mayhave a copy of the network. Data quality may be maintained by massivedatabase replication and computational trust. Centralized officialcopies may not exist. Transactions may broadcast to the network usingsoftware. Messages may be delivered on a best-effort basis. Nodes (suchas mining nodes) may validate transactions and activities, add them tothe block they are building, and may broadcast the completed block toother nodes according to the structures, methods, distributionmechanisms, and constructs described herein.

The database network system may comprise a mechanism to assign each nodea hierarchical level in the hierarchical construct. The method mayfurther comprise distributing data according to the constructedhierarchical model. The hierarchical level of each node may correspondto its level or position in the hierarchical model and/or in thenetwork. The method may comprise measuring, calculating, and/orquantifying a trusted score for each node. The nodes in the network maybe sorted, categorized, and/or ranked in a hierarchical model based onrespective trusted scores associated with the nodes. The trusted scoreof the nodes may be calculated according to the methods described hereinand may be accumulated over time. The trusted score of each node maydetermine its respective position in the hierarchical construct.Further, data may be distributed in the network according to thehierarchical construct in an efficient and secure method for datadistribution and storage.

Assigning Trusted Scores

Provided herein is a method for constructing a database network systemfrom a plurality of nodes for decentralized data distribution. Themethod may comprise using a plurality of tests to assay a computingpower of each of the plurality of nodes. In some cases, assaying acomputing power of each of the plurality of nodes may be performedsubstantially simultaneously. In some examples, each of the plurality ofnodes may receive a different test of the plurality of tests.Beneficially, this prevents different nodes from colluding andleveraging the computing power of another node. The method may furthercomprise determining a test score for the each of the plurality of nodesbased at least in part on the determined computing power. The method mayfurther comprise determining a trusted score for the each of theplurality of nodes based on the test score. In some cases, the trustedscore may be based at least in part on a sum of the test score and anaccumulated trusted score for the each of the plurality of nodes, ifany. For example, the trusted score for a node may be updated with eachtest that the node is assayed with. Beneficially, the trusted score mayreflect an accumulated loyalty level of the node to the database networksystem and credit such node accordingly. The method may further comprisegenerating a hierarchical construct of the plurality of nodes based onthe respective trusted scores of the plurality of nodes. A node of theplurality of nodes in the hierarchical construct may be configured toreceive a data block from a parent node (at a higher hierarchical levelin the construct than that of the node) and distribute that data blockto at least two child nodes (at a lower hierarchical level in theconstruct than that of the node). The parent node may have a highertrusted score than the node and the node may have a higher trusted scorethan each of the at least two child nodes. In some cases, the at leasttwo child nodes may be at the same lower hierarchical level relative tothe node. In other cases, the at least two child nodes may be atdifferent lower hierarchical levels relative to the node.

In some examples, the method may further comprise repeating the method(e.g., providing a test; determining a test score; determining a trustedscore; generating a hierarchical construct). The plurality of tests maybe calculated by the plurality of nodes. In some cases, two tests of theplurality of tests provided to the at least two child nodes may becalculated by the node. Further, the trusted score for the node may bebased at least in part on a given test score for a child node of the atleast two child nodes.

In some cases, the tests on each of the plurality of nodes may beperformed substantially simultaneously. Substantially simultaneously maycomprise at most about 10 seconds (s), at most about 9 s, at most about8 s, at most about 7 s, at most about 6 s, at most about 5 s, at mostabout 4 s, at most about 3 s, at most about 2 s, at most about 1 s, atmost about 0.9 s, at most about 0.8 s, at most about 0.7 s, at mostabout 0.6 s, at most about 0.5 s, at most about 0.4 s, at most about 0.3s, at most about 0.2, or less. In some cases, the tests on each of theplurality of nodes may be performed in real-time.

The plurality of tests may comprise calculation of a total block hashbased on random block numbers. The method may further comprisedistributing the data block from the parent node to the node, and fromthe node to the at least two child nodes. The method may furthercomprise validating the data block, by the each of the plurality ofnodes, based on one or more trusted scores of one or more nodes in anupstream distribution path of the data block

The database network system and/or the hierarchical construct mayfunction based on the trusted score assigned to each node of theplurality of nodes. In some cases, in order for blocks to be added tothe database network system and/or in order for nodes to enter thedatabase network system or remain in the database network system or getpromoted to a higher hierarchical level in the database network system,a scoring system may be involved. In some cases, game theory may beinvolved. For example, the nodes in the network may compete with anothernode to find a value which may be produced from the hash function. Thevalue may be referred to as nonce, score, trusted score, trust score,and/or incentive. The trusted scores may be collected and accumulatedover time.

Each node of the plurality of the nodes in the network and/or system maybe assigned a trusted score. The trusted score of each note may in wholeor in part correspond to its level in the hierarchical construct. Insome cases, trusted scores may be calculated based on computation powersof the nodes. In some cases, tests may be designed to measure thecomputation powers of the nodes. In some cases, test scores may beaccumulated during the lifetime of the node in the database networksystem. In some cases, the duration of time a given node has spent inthe network may directly or indirectly correspond to its trusted scoreand hierarchical level. The longer a node stays in the network the moreincentives it may collect, and its hierarchical level in thehierarchical construct/model may increase. The higher the trusted score,the higher the level of the node in the hierarchical construct. Forexample, the top node may have the highest trusted score among all thenodes in the database network system.

FIG. 1 illustrates an example hierarchical construct for decentralizeddata distribution. Data blocks may be distributed throughout thenetwork. The database network system provided herein may comprise aplurality of nodes communicating in a hierarchical construct. In somecases, the hierarchical construct may comprise a pyramidal binaryhierarchical construct, such as the pyramidal hierarchical constructillustrated in FIG. 1 . A node 120 of the plurality of nodes in thehierarchical construct may be configured to receive a data block from aparent node 110 and distribute the data block to at least two childnodes (also referred to as sub-nodes) 130 and 140. In some cases, A nodeof the plurality of nodes in the hierarchical construct may beconfigured to receive a data block from a parent node and distribute thedata block to two child nodes. A parent node may have a higher trustedscore and a higher level in the hierarchical structure (e.g., pyramidalconstruct) compared to a child node. The parent node 110 may have ahigher trusted score than the node. The node 120 may have a highertrusted score than each of the at least two child nodes 130 and 140.

In some cases, the node may be configured to distribute the data blockto at most two child nodes. In some cases, a given node (such as a nodeserver) in the construct may only have to transfer its data to two othernodes (e.g., corresponding child nodes or sub-nodes). This may increasedata transmission speed (e.g., transaction speed) as compared to ascenario where each node would have to transfer its data to more thantwo nodes, such as to many more nodes, such as randomly, such as in anon-hierarchical manner, or non-pyramidal manner. In addition, this mayhave the benefit of decreasing the overhead for the trusteddecentralized network. In some cases, data transmission speed, such astransaction speed reached by leveraging the methods and systems of thepresent disclosure, such as distributing data according to thehierarchical construct described herein may approach that of acentralized system, reach that of a centralized system, or besubstantially similar to that of a centralized system, while alsoproviding the benefits of a decentralized database network system.Otherwise, transaction speeds of an example centralized system may inmany cases be higher, substantially higher, or significantly higher thanan example decentralized network system not comprising a hierarchicalconstruct such as the one described herein. The high speed andefficiency of data distribution which may in some cases be substantiallysimilar to that of an example centralized network may benefit thescalability and real-world applicability of the database network systemprovided herein. In some cases, the node may be configured to distributethe data block to more than two child nodes. In some cases, the node maybe configured to distribute the data block to at most about 100 nodes,90 nodes, 80 nodes, 70 nodes, 60 nodes, 50 nodes, 40 nodes, 30 nodes, 20nodes, 10 nodes, 9 nodes, 8 nodes, 7 nodes, 6 nodes, 5 nodes, 4 nodes, 3nodes, or fewer. Alternatively or in addition, the node may beconfigured to distribute the data block to at least about 1 node, 2nodes, 3 nodes, 4 nodes, 5 nodes, 6 nodes, 7 nodes, 8 nodes, 9 nodes, 10nodes, 20 nodes, 30 nodes, 40 nodes, 50 nodes, 60 nodes, 70 nodes, 80nodes, 90 nodes, 100 nodes or greater. The number of child nodes thateach node is configured to distribute to in the hierarchical model(e.g., pyramidal construct) may be optimized.

In some cases, data distribution through the network of the nodes mayprogress exponentially. As data moves further down the hierarchicalconstruct, more nodes may become involved in data distribution (e.g.,from 1 to 2 to 4 to 8 to 16 to 32 and so on). More nodes may beactivated to transfer and validate data and/or data blocks. The furtheran example data block goes downstream in a hierarchical construct, itmay reach higher transfer and validation speeds, and the workload ofdata distribution may rapidly increase. In some cases, the rapidincrease may be exponential. The hierarchical construct described hereinmay propagate the workload. In some cases, the workload may bepropagated exponentially. In some cases, the hierarchical construct mayprovide other benefits, such as enhanced trust and value, resistanceagainst attacks, governance of reward and penalty, value trust, secureblock validation, and more benefits described herein.

In some examples, the speed, capacity, and/or efficiency of thehierarchical network may be estimated or evaluated based on the speed,capacity, and efficiency of one of its nodes. The capacity of a givennode may vary. In some cases, if the transmission bandwidth is good, theoverhead may decrease, substantially decrease, or be minimized. In anexample scenario where the capacity of every node in the construct isequal to or substantially equal to that of the top node, any delayand/or congestion in the data distribution throughout the decentralizednetwork can be prevented.

A node may be configured to validate the data block based on one or moretrusted scores of one or more nodes in an upstream distribution path ofthe data block, such as a path defined by the hierarchical constructdescribed herein. A distribution path may comprise the transfer and/ordistribution of data from nodes at a higher level to nodes at lowerlevels, for example according to the hierarchical construct, such as apyramid binary construct. Data may start distributing from the top nodewhich may be for example at the top of the pyramidal construct andtransfer to the other nodes further down the construct. In some cases,each of the plurality of nodes may comprise a copy of the hierarchicalconstruct. The activities in the network, such as the transactions inthe network may be referred to and/or propagated to the top node, andthereby be verified. A block of data may be populated and distributedthroughout the network. For example, a given node may receive an exampledata block. It may verify the trusted scores of its preceding nodes inthe distribution path, in some cases, all the way back to the top nodeserver. This may confirm the distribution path and/or the origin of thedata distribution block.

In some cases, validation may further comprise a random confirmation ofthe data. This may help avoid compromised data and origin of the datadistribution block. Random confirmation of data for an exampledistribution block may be performed based on the hash of an upper node,such as a node at a higher hierarchical level compared to the nodes ofthe block. As such, random block validation may involve a small datasize overhead, while it may add an extra proof and/or seal of thedistribution path and the origin of the distribution (e.g., transaction0block.

In some cases, potential compromises of data blocks of a mid-node serverand/or external alien server may be capable of being detected andrejected. Block validation throughout the distribution in the networkmay contribute to building a trusted network. In some cases, ensuringblock validation throughout the distribution in the network mayestablish a trusted network.

The data block may comprise a cryptographic hash of a previous datablock in a blockchain network. The blockchain network may comprise theprevious data block and the current data block. The node may beconfigured to further validate the data block based on the cryptographichash. In some cases, each node may have a current copy of thehierarchical construct (e.g., pyramid structure). This may act as a sealfor consensus for the data path and trust of the network.

In an example scenario where a sub-node would be offline or inactive,for example by congestion, its sub-nodes, such as nodes that are in alower hierarchical level in the construct compared to the mentionedcongested node may be chosen to continue the distribution of data andits path. Distribution may continue in the network, bypassing thecongested node. In case the congested node re-activates, for examplebecomes online after being offline for a while, it may update its missedblocks and rejoin and participate in data distribution in the network.

The distribution or flow of data in the network can be maintained and/orpreserved by various security measures. An attack on an intermediatenode (a node other than the top node) may not disrupt data distributionin the network. In case the top node in the hierarchical construct or anexample data block is attacked, one of its child nodes, or sub-nodes,such as a node that is one level lower than that top node in thehierarchical construct may take over and be allocated as the top node inthe construct. A second attack on the allocated node may promptallocation of the next node in line (such as a child node, a sub-node,or a node which is one level lower in the hierarchy) as the next topnode, and so on. In some cases, the hierarchical construct such as thepyramidal construct may be secured against outside attacks. In somecases, it may be immune to attacks until the last node in the network.

Each node of plurality of nodes in the network may comprise a copy ofthe hierarchical construct. This may in some cases function as apassthrough seal to prevent potential data breach or the entrance ofalien attacks or attacked data into the network. The origin of theexternal alien server or the source of the attack data may beidentified, in some cases at least at part by comparing such source withthe copy of the hierarchical construct carried through by an examplenode in the network, a plurality of nodes in the network, or all thenodes in the network. An attack-resistance defense mechanism can beconstructed without using a proof-of-work consensus method. In somecases, the security procedures and/or attack resistance defensemechanism described herein may be more secure than a proof-of-workprocedure. In addition, a proof-of-work mechanism may require usingsignificant or substantial computer power over time, or almost all thetime. The method described herein may not use a proof-of-work mechanismand may be more secure and at the same time consume less computer powerover time.

The hierarchical construct, such as a pyramidal construct may begenerated or constructed according to trusted scores the nodesaccumulate. Each node may be tested and assigned a trusted score. Nodesmay be tested fairly. For example, each node's computing power may bemeasured and tested. In some cases, the time period for testing eachnode's computing power may be relatively short (for example relative tothat used in a proof-of-work mechanism). This may preserve computerpower and capacity to be potentially or optionally spent to execute thenetworks intended functional application rather than spending most ofits power and capacity to calculate the computing power of the nodes, asthe case may be in a proof-of-work mechanism. To accomplish this, insome cases, the test may be given to all the nodes simultaneously,substantially simultaneously, at about the same time, within a shorttime interval, within a minimal time interval, or within a time intervalasymptotically approaching zero, in real-time, or in substantiallyreal-time. In some cases, the test for each node in the network may beaccurately performed at such time intervals.

In an example, the hierarchical construct may facilitate datadistribution to about 1.3 million nodes in less than about 0.4 seconds(s). The hierarchical construct may facilitate data distribution toabout 1 million nodes in less than about 1 s, 0.9 s, 0.8 s, 0.7 s, 0.6s, 0.5 s, 0.4 s, 0.3 s, 0.3 s, or less. In the same example, the latencybetween the nodes may be 20 milliseconds (ms), and the bandwidth speedmay be 1 mbs. In the same example, the latency between the nodes may beat most about 100 milliseconds (ms), 90 ms, 80 ms, 70 ms, 60 ms, 50 ms,40 ms, 30 ms, 20 ms, 15 ms, 10 ms, or less. The bandwidth speed may be 1mbs. In some examples, the bandwidth speed may be at most about 0.5 mbs,0.6 mbs, 0.7 mbs, 0.9 mbs, 1 mbs, 1.5 mbs, 2 mbs, 2.5 mbs, 3 mbs, 3.5mbs, or more. In some examples, the bandwidth speed may be at leastabout 0.5 mbs, 0.6 mbs, 0.7 mbs, 0.9 mbs, 1 mbs, 1.5 mbs, 2 mbs, 2.5mbs, 3 mbs, 3.5 mbs, or more. In some cases, a tree-exponentialdistribution may be performed. This may enable the testing of eachnode's computation power to be accurately performed simultaneously,substantially simultaneously, at about the same time, within a shorttime interval, within a minimal time interval, or within a time intervalasymptotically approaching zero, in real-time, or in substantiallyreal-time.

In some cases, unique tests are given to individual nodes in the systemto avoid a scenario where a given node can calculate the answer to thetest and distribute it to other nodes. In some cases, the top node maybe given two different tests for its two corresponding sub-nodes orchild nodes in the pyramidal construct. Each of those sub-nodes may begiven two different tests for their own two corresponding sub-nodes inthe pyramidal construct. A similar trend may continue throughout thenetwork.

Each node at a higher hierarchical level network may be given twodifferent tests for its two corresponding sub-nodes in the pyramidalconstruct. This way, by distributing the tasks of calculating the testthroughout the network, each node may receive a different test withoutextra overhead or any overhead. The difficulty level of the tests givento individual nodes in the network may be similar, substantiallysimilar, or the same for all the nodes. Alternatively, the difficultylevels may slightly vary, or be somewhat different. Each node (e.g.,sever node) may transmit, deliver, or send the tests to itscorresponding sub-nodes in the pyramidal construct and measure the timeit takes for the test results to come back from those nodes. The servernode may then use the measured time to calculate each of those nodes'computation power. For example, a test may be to calculate the totalblock hash for a random number of data blocks. Each node may receive atest to calculate the total block hash for a unique (different from thetests other nodes received) random number of blocks. Generating randomnumbers of blocks or a range of random numbers of blocks may be fastand/or computationally inexpensive. Calculating the total hash of theblock may be easily achieved, light, and computationally inexpensive,while it can accomplish the task of measuring the nodes' computationpower. In some cases, it may confirm that the test was taken, and fullcomputing power of the node may be efficiently measured and/orcalculated.

In some cases, incentives may be given to the nodes of the network. Anincentive may be given to an example node at least partly based on thetest results of its corresponding sub-nodes, such as the nodes that areat a lower hierarchical level compared to that node. Tests scores ortest results may be calculated according to the methods describedherein, such as a computation power test described herein. The positionof each node in the network, such as its hierarchical level in thenetwork (e.g., in the hierarchical construct) can be altered based onthe incentive(s) it is given and/or it has acquired.

For example, nodes may move up and/or down in the network based on theincentives they are given according to the test scores of theircorresponding sub-nodes. For example, the nodes that are at a lowerhierarchical level compared to an example node may contribute to theincentives of the node at the higher hierarchical level. In some cases,a top node may neither advantage nor disadvantage the incentives and/ortest scores of its sub-nodes. A node that may be considered as a topnode compared to a plurality of sub-nodes may not advantage theincentives and test scores of its sub-nodes because that may compromiseits own position as the top node (such as its higher hierarchical level)in the network. For example, in an example scenario if a top nodeadvantages the incentive and/or test scores of its sub-nodes, suchsub-nodes may move up and compete with the top node for its position.Likewise, a node that may be considered as a top node compared to aplurality of sub-nodes may not disadvantage the incentives and/or testscores of its sub-nodes because that may be unfavorable for its ownincentive. This mechanism may help facilitate the distribution of thecomputation power tests throughout the network. In some cases, thedistribution may be even, fair, unbiased, and/or substantially unbiased.In some examples, this mechanism may contribute to stabilizing thenetwork.

Each node in the network may carry a score and/or a score weight ofvalue on which the hierarchical construct, such as a hierarchicalpyramidal construct, or a pyramid-chain may be built. The incentivestructure may prevent and/or discourage the nodes from leaving thenetwork. This may encourage adoption viability and/or the addition ofmore nodes to the network. As the scores of the nodes accumulate duringtheir lifetime, a long-term credibility may be established in thenetwork. The value of the network may be based on the real computingpower of the network and/or the nodes of the network, and or both. Insome cases, the network may be used as a medium of exchange of value,such as for transactions. In some cases, the network may comprise acredible medium of exchange of value, the credibility of which may bebased on its real computation power which may be accumulated in each ofits nodes during their lifetime in the network.

The position of each node in the network (such as its level in thehierarchical construct) may be determined at least in part, based on itscomputation power. A computation power of a node may be measured and/orcalculated by giving it a computation power test, such as the testsdescribed herein. The test scores may directly and/or indirectlycorrespond to the computation power of the node. The computation powerof the node may directly and/or indirectly, in whole or in part,determine its position in the hierarchical construct. In some cases, acomputation power of a node may be secure and/or substantially secureagainst manipulation by other factors such as external factors.Therefore, in some cases, the computation power of an example node maynot be easily manipulated. In some cases, a computation power of anexample node may be completely secure against manipulation.

In some cases, an unknown reason or a plurality of unknown reasonsand/or factors may affect the position of an example node in the networkto either promote or demote it. For example, an unknown factor may causea node to move to a higher or lower hierarchical level in the construct.In an example, the transfer of a score value may change the position ofan example node in the network.

In some cases, movement (such as a change in the hierarchical position)of example nodes in the network may not be independent of the movementof other nodes in the network. In some cases, movement (such as a changein the hierarchical position) of example nodes in the network may dependof the movement of other nodes in the network. In some cases, a changein a position of an example node (e.g., a movement of a node in thenetwork) may depend on or be affected by a change in the position of oneor more other nodes in the network. For example, in some cases, themovement of one node in the network may affect the position of one ormore nodes in the network by causing them to promote (move to a higherhierarchical level) or demote (move to a lower hierarchical level). Forexample, one node may promote to a higher level causing one or moreother nodes to move to lower hierarchical level(s). In some cases, thenodes in the network may compete for higher positions. Competition maybe at least in part based on the nodes' computation power. In somecases, additional factors may be involved in the competition as well. Insome cases, competition of the nodes for higher positions may be basedon their computation powers and the time each node has spent in thenetwork. Nodes which have spent more time in the network may buildloyalty and be incentivized compared to nodes that have similarcomputation powers but have spent shorter times in the network.

In some examples, whether or not a given node may be promoted to ahigher level in the network may cost another node a portion of its valuescore. For example, at least part of an example node's value score maybe transferred to another node, thereby promoting that other node. Thismechanism may comprise or be a voting mechanism. The transfer of scorevalue from one node to another may be considered an important event. Onereason may be that the value score for each node may have beenaccumulated during its lifetime in the network, at least in part basedon its computation power (e.g., based on its performance in computationpower tests given to it during its lifetime in the network). The valuescore of a node may have been accumulated over the long-term. Therefore,the transfer of a value score from one node to another node and therebypromoting and/or demoting such node(s) may be considered an importantevent. This mechanism may comprise a price tag for network governance.It may contribute to creating a stable network. In some cases, it mayensure creating a stable network. For example, the transfer ofcomputation score from a given node to another, and the inter-dependentmovement of the network nodes in the hierarchical construct may helpgenerate a stable network. In some cases, an upper rogue node may existin the network. In some cases, a stable network may be generated even inthe case of an upper rogue node. An upper rogue node may be a node (suchas a user node) that may be in a higher hierarchical level in thehierarchical construct compared to a plurality of nodes, which mayremain connected to the database network system, yet may not havepermission to access and operate in the database network system. In themethods and systems provided herein, in some cases, the existence ofsuch nodes may not interrupt the stability of the database networksystem.

Application Interfaces

Provided herein are blockchain-integrated interfaces. Ablockchain-integrated interface may provide a decentralized application.A decentralized application may comprise or facilitate extending orappending an activity, such as a transaction, in a block. Adecentralized application may comprise using the extended activity, suchas the extended transaction to identify and/or reference informationregarding internal and/or external data associations. Various types ofapplications may be developed in the database network system. In someexamples, provided herein are applications, platforms, and interfaces.

In some examples, provided herein is a platform, such as an application,such as an interface, for storing, managing, maintaining, transferringand/or using documents. The platform may be a document platform. Theplatform, application, and/or interface may be referred to as thedocument engine. In some cases, the platform, application, and/orinterface may be given other names. The platform or applications may beused to handle, store, manage, or distribute documents.

The document platform may be an application of a database network systemfor data distribution, such as blockchain network. In some cases, thedocument platform may operate according to the structures and themechanisms of the hierarchical construct and/or the database networksystem and mechanisms (e.g., the blockchain network system) describedherein. Alternatively, the method of operation of the document platform(e.g., the document engine) may be different from the structures and themethods described for the database network system.

The documents may be any type of documents. In some cases, the documentsmay comprise or be transaction documents. In some cases, the documentsmay comprise or be legal documents. In some examples, the documents maybe recorded as evidence, record, or proof for a transaction and/or atransfer of a value. Value may be any type of value, such as an asset orproperty. In some cases, the documents may be documents relevant to thetransactions performed using the database network system providedherein. In some cases, the documents may comprise other source(s) ofinformation. In some examples, the documents may comprise recordsregarding transactions performed using databases, networks, or mediaother than the network provided herein. In some cases, the documents mayhave multiple sources, such as 1 source, 2 sources, 3 sources, 4sources, 5 sources, or more sources. A combination of sources mayprovide information to the platform (e.g., the document engine).

Provided are also the methods of operation and the methods of use of thedocument platform. In some examples, a plurality of documents may becombined in one or more files. Each file may have a predetermined size.In some cases, a plurality of documents may be combined in a singlefile. The file may have a predetermined size. The one or more files,such as a single file comprising the documents may be distributed in adatabase network, such as a blockchain network, such as the databasenetwork system described herein. In some cases, the one or more filescomprising the documents may be distributed throughout the network alongwith additional data and/or additional data blocks. The additional datamay be relevant to the content of the documents. Alternatively, theadditional data may not be relevant to the content of the documents. Theadditional data may have any content and/or any source. The one or morefiles may be distributed in whole or in part throughout part of thenetwork or the entire network for any reason.

As an example, the documents may be transaction documents. In somecases, the one or more files comprising the documents may be distributedthroughout the network along with transaction data and/or transactiondata blocks. In another example, documents may be legal documents, ordocuments recording a transfer of an object of value, such as aproperty, asset, or other. The additional data may comprise any datawhich in some cases may be relevant to the documents.

In some cases, the documents and/or the one or more files may form anintegrated unit along with the additional data which may be distributedwith them. For example, the documents and/or document files (such as theone or more files comprising the documents) may form an integrated unitalong with the additional data and be distributed throughout thenetwork. In an example, one or more transaction data blocks may form anintegrated unit with one or more files comprising transaction documents.In some cases, the integrated unit may be used for distributing and/orupdating the documents, the additional data, and/or both. In someexamples, the documents and a transaction block may form an integratedunit for distribution and updating information in the documents, theother data, and/or both. For example, the documents, the one or morefiles comprising the documents, and/or other data may be distributed toa new node which may join the network. In some cases, a node may turnoffline, and turn back online after a certain time. The documents, theone or more files comprising the documents, and/or other data may bedistributed to or updated in a node which may had been turned offlineand may have turned back online after a set period of time.

In some cases, a document may comprise an extension of a data line inthe block. For instance, a transaction may take place. Data regardingthe transaction may be generated. A document may comprise informationregarding the event, such as a transaction or other event. For example,a document may be a transaction document. A transaction document maycomprise an extension of a transaction line in the block.

The documents may comprise transaction documents, legal documents,invoice documents, media, picture, video, sound, or other types ofmedia, games, or other types of data, documents and/or contents ofdocuments of any format, type, and/or size. The documents may have anylength. The document platform may comprise or be capable of facilitatingdiverse types of applications. Such applications may compriseinteraction applications. In some cases, interaction applications mayhave relatively small sizes or involve relatively small document sizesand/or lengths, such as small lines compared to other applications.Applications may comprise invoice document applications. In some cases,invoice document applications may comprise medium sizes and/or involvemedium document sizes (relatively, compared to other applications andother document types). Applications may comprise media documentapplications. In some cases, media document applications may compriserelatively large sizes compared to other applications and/or other typesof documents.

In some cases, transaction types may be part of an example extensionline. Transaction types may identify an example transaction for aspecific action at a specific time, such as the present time, or a settime in the future. For example, potential future applications may beadded by allocating a new transaction type while other activities, suchas transactions, are concurrently being performed at the present time.In some cases, potential future applications may be added by allocatinga new transaction type without crowding and/or influencing theactivities being performed at the present time.

In some cases, transaction lines may be mixed. Transaction lines may bemixed at the final stage of the block construct.

Applications with various functions may be developed to run in thedatabase network system.

Blocks in the network system may hold batches of valid transactions thatmay be hashed and encoded into a structure. Each block may include acryptographic hash of the prior block in the blockchain network, whichmay link them. In some cases, the blockchain network may be a trustedblockchain network.

Decentralized applications may comprise functions such as searchingand/or performing search queries. Performing search queries in thedatabase network system provided herein may have several advantages overperforming them in other networks. For example, in some cases, newapplications may be developed and/or added to the network providedherein without indexing and/or grouping example datasets in certaincategories. Indexing may have the disadvantage of increasing thecomputational burden on the network and/or slowing down datadistribution in the network. For example, in some cases, indexing and/orgrouping datasets together may be data-heavy. In some cases, suchindexing may need to be replicated throughout all the nodes in thenetwork, which may make it even heavier. Linking the blocks in thedatabase network system presented herein may increase the speed of datadistribution throughout the network. Multiple applications may be addedto the network. In some cases, the multiple applications may be addedand/or run concurrently. In some cases, rapid data distribution may beperformed while adding multiple applications. Multiple applications maycomprise search queries. Search queries may be performed withoutindexing datasets. Not indexing dataset may increase the search speeds.

The database network system provided herein may comprise an applicationprograming interface (API) and may be used for developer applications.

Various programming and/or scripting languages may be used to developnew applications in the database network system provided herein.Programming or scripting languages may comprise JavaScript (JS), NodeJS,C, C++, C #, Objective-C, VBScript, PHP (Hypertext Processor), Perl,Python, Ruby, Ruby on Rails, ASp, Tcl, HTML (HyperText Markup Language),Java, SQL (Structured Query Language), Swift, and other programminglanguages.

Programming and/or scripting languages may comprise A #.NET, A-0 System,A+, A++, ABAP, ABC, ABC ALGOL, ACC, ACCENT, ACE DASL (DistributedApplication Specification Language), Action!, ActionScript, Actor, Ada,Adenine, Agda, Agilent VEE, Agora, AIMMS, Aldor, Alef, ALf, ALGOL 58,ALGOL 60, ALGOL 68, ALGOL W, Alice, Alma-0, AmbientTalk, Amiga E, AMOS,AMPL, AngelScript, Apex, APL, App Inventor for Android's visual blocklanguage, AppleScript, APT, Arc, ARexx, Argus, Assembly language,AutoHotkey, AutoLISP/Visual LISP, Averest, AWK, Axum, Active ServerPages, B, Babbage, Ballerina, Bash, BASIC, bc, BCPL, BeanShell, Batchfile (Windows/MS-DOS), Bertrand, BETA, BLISS, Blockly, BlooP, Boo,Boomerang, Bourne shell (including bash and ksh), C, C−−, C++, C*, C #,C/AL, Cache ObjectScript, C shell, Caml, Cayenne, Cduce, Cecil, Cesil,Céu, Ceylon, CFEngine, Cg, Ch, Chapel, Charity, Charm, CHILL, CHIP-8,chomski, ChucK, Cilk, Citrine, CL (IBM), Claire, Clarion, Clean,Clipper, CLIPS, CLIST, Clojure, CLU, CMS-2, COBOL, CobolScript, Cobra,CoffeeScript, ColdFusion, COMAL, Combined Programming Language (CPL),COMIT, Common Intermediate Language (CM), Common Lisp (Cl), COMPASS,Component Pascal, Constraint Handling Rules (CHR), COMTRAN, Cool, Coq,Coral 66, CorVision, COWSEL, CPL, Cryptol, Crystal, Csound, CSP,Cuneiform, Curl, Curry, Cybil, Cyclone, Cython.

Programming and/or scripting languages may comprise D, Datapoint'sAdvanced Systems Language (DASL), Dart, Darwin, DataFlex, Datalog,DATARIEVE, dBase, dc, DCL, DinkC, DIBOL, Dog, Draco, DRAKON, Dylan,DYNAMO, DAX (Data Analysis Expressions), E, Ease, Easy OL/I, EASYTRIEVEPLUS, eC, ECMAScript, Edinburgh IMP, EGL, Eiffel, ELAN, Elixir, Elm,Emacs Lisp, Emerald, Epigram, EPL (Easy Programming Language), EPL(Eltron Programming Language), Erlang, es, Escher, ESPOL, Esterel,Etoys, Euclid, Euler, Euphoria, EuLisp Robot Programming Language, CMSEXEC (EXEC), EXEC 2, Executable UML, Ezhil, F, F #, F*, Factor, Fantom,FAUST, FFP, Fjölnir, FL, Flavors, Flex, FlooP, FLOW-MATIC, FOCAL, FOCUS,FOIL, FORMAC, @Formula, Forth, Fortran, Fortress, FP, FRanz Lisp, andF-Script.

Programming and/or scripting languages may comprise Game Maker Language,GameMonkey Script, GAMS, GAP, G-code, GDScript, Genie, GDL, GEORGE,GLSL, GNU E, Go, Go!, GOAL, Gödel, Golo, GOM (Good Old Mad), Google AppsScript, Gosu, GOTRAN, GPSS, GraphTalk, GRASS, Grasshopper, Groovy, Hack,HAGGIS, HAL/S, Halide (programming language), Gamilton C Shell, Harbour,Hartmann pipelines, Haskell, Haxe, Hermes, High Level Assembly, HLSL,Hollywood, HolyC, Hop, Hopscotch, Hope, Hugo, Hume, HyperTalk, Io, Icon,IBM Basic assembly language, IBM HAScript, IBM Informix-4GL, IBM RPG,Irineu, IDL, Idris, and Inform.

Programming and/or scripting languages may comprise J, J #, J++, JADE,JAL, Janus (concurrent constraint programming language), Janus(time-reversible computing programming language), JASS, Java, JavaFXScript, JCL, JEAN, Join Java, JOSS, Joule, JOVIAL, Joy, JScript,JScript.NET, Julia, Jython, K, Kaleidoscope, Karel, KEE, Kixtart,Klerer-May System, KIF, Kojo, Kotlin, KRC, KRL, KRL (KUKA RobotLanguage), KRYPTON, Korn shell (ksh), Kodu, and Kv.

Programming and/or scripting languages may comprise LABVIEW, Ladder,LANSA, Lasso, Lava, LC-3, Legoscript, LIL, LilyPond, Limbo, Limnor,LINC, Lingo, LINQ, LIS, LISA, Lisp, Lite-C, Lithe, Little b, LLL, Logo,Logtalk, LotusScript, LPC, LSE, LSL, LiveCode, LiveScript, Lua, Lucid,Lustre, LYaPAS, Lynx, M2001, M4, M #, Machine code, MAD (MichiganAlgorithm Decoder), MAD/I, Magik, Magma, Maude system, Mani, Maple,MAPPER, BIS, MAPPER (part of BIS), MDL, Mercury, Mesa, Metafont, MHEG-5(Interactive TV programming language) Microcode, MicroScript, MIIS, Milk(programming language), MIMIC, Mirah, Miranda, MIVA Script, ML, Model204, Modelica, Modula, Modula-2, Modula-3, Mohol, MOO, Mortran, Mouse,MPD, Mathcad, MSL, MUMPS, MuPAD, Mutan, and Mystic Programming Language(MPL).

Programming and/or scripting languages may comprise NASM, Napier88,Neko, Nemerle, NESL, Net.Data, NetLogo, NetRexx, NewLISP, NEWP,Newspeak, NewtonScript, Next Generation Shell, Nial, Nice, Nickle(NIITIN), Nim, NPL, Not eXactly C (NXC), Not Quite C (NQC), NSIS, Nu,NWScript, NXT-G, o:XML, Oak, Oberon, OBJ2, Object Lisp, ObjectLOGO,Object REXX, Object Pascal, Objective-C, Objective-J, Obliq, OCaml,occam, occam-π, Octave, OmniMark, Onyx, Opa, Opal, OpenCL, OpenEdge ABL,OPL, OpenVera, OPS5, OptimJ, Orc, ORCA/Modula-2, Oriel, Orwell, Oxygene,Oz, P, P4, P″, ParaSail (programming language), PARI/GP, Pascal, PCASTL,PCF, PEARL, Perl, PDL, Pharo, PHP, Pico, Picolisp, Pict, Pig(programming tool), Pike, PILOT, Pipelines, Pinecone, Pizza, PL-11,PL/0, PUB, PL/I, PL/M, PL/P, PL/SQL, PL360, PLANC, Plankalla, Planner,PLEX, PLEXIL, Plus, Pony, POP-11, POP-2, PostScript, PortablE, POV-RaySDL, Powerhouse, PowerBuilder, PowerBuilder (4GL GUI applicationgenerator from Sybase), PowerShell, PPL, Processing, Processing.js,Prograph, PROIV, Prolog, PROMAL, Promela, POROSE modeling language,PROTEL, ProvideX, Pro*C, Pure, Pure Data, PureScript, and Python.

Programming and/or scripting languages may comprise Q (programminglanguage from Kx Systems), Q # (Microsoft programming language), Qalb,QtScript, QuakeC, QPL, Qbasic, R, R++, Racket, Raku, RAPID, Rapira,Ratfiv, Ratfor, rc, Reason, REBOL, Red, Redcode, REFAL, REXX, Rlab,ROOP, RPG, RPL, RSL, RTL/2, Ruby, RuneScript, Rust, S, S2, S3, S-Lang,S-PLUS, SA-C, SabreTalk, SAIL, SAM76, SAS, SASL, Sather, Sawzall, ScalaScheme, Scilab, Scratch, Script.NET, Sed, Seed7, Self, SenseTalk,SequenceL, Serpent, SETL, SIMPOL, SIGNAL, SiMPLE, SIMSCRIPT, Simula,Simulink, Singularity, SISAL, SLIP, SMALL, Smalltalk, SML, Strongtalk,Snap!, SNOBOL (SPITBOL), Snowball, SOL, Solidity, SOPHAEROS, SPARK,Speakeasy, Speedcode, SPIN, SP/k, SPS, SQL, SQR, Squeak, Squirrel, SR,S/SL, Starlogo, Strand, Stata, Stateflow, Subtext, SBL, SuperCollider,SuperTalk, Swift (Apple programming language), Swift (parallel scriptinglanguage), SYMPL, and SystemVerilog.

Programming and/or scripting languages may comprise T, TACL, TACPOL,TADS, TAL, Tcl, Tea, TECO, TELCOMP, TeX, TEX, TIE, TMG(compiler-compiler), Tom, TOM, Toi, Topspeed, TPU, Trac, TTM, T-SQL,Transcript, TTCN, Turing, TUTOR, TXL, TypeScript, Tynker, Ubercode, UCSDPascal, Umple, Unicorn, Uniface, UNITY, Unix shell, UnrealScript, V,Vala, Verilog, VHDL, Vim script, Viper, Visual Basic, Visual Basic. NET,Visual DataFlex, Visual DialogScript, Visual Fortran, Visual FoxPro,Visual J++, Visual LISP, Visual Objects, Visual Prolo, VSXu, WATFIV,WATFOR, WebAssembly, WebDNA, Whiley, Winbatch, Wolfram Language, Wyvern,X++, X10, xBase, xBase++, XBL, XC (targets XMOS architecture), xHarbour,XL, Xojo, XOTcl, XOD (programming language), XPath, XPL, XPL0, XQuery,XSB, XSharp, XSLT, Xtend, Yorick, YQL, Yoix, YUI, Z notation, Zebra,ZPL, ZPL2, Zeno, ZetaLisp, ZOPL, Zsh, ZPL, Z++, and more.

In some cases, one or more programming and/or scripting languages may beused to develop an application in the database network system. In somecases, a combination of different programming and/or scripting languagesmay be used. In some examples, NodeJS may be used as the base frameworkof every node in the network. In some cases, the root network andrelevant protocols (in whole or in part) may be done in C/C++. In someexamples, JavaScript may be used to develop and/or produce applications.Other combinations of programming and/or scripting languages may be usedas the base framework of the nodes in the network (in whole or in part).The root network and relevant protocols may be done in any programminglanguage or combinations thereof.

Security Mechanisms for Dynamic Pyramid Construct

The present disclosure provides security mechanisms for dynamic,decentralized data distribution. A database network may comprise aplurality of nodes as described elsewhere herein. The plurality of nodesmay communicate in a dynamic hierarchical construct. The dynamichierarchical construct may comprise a top node. A node of the pluralityof nodes in the dynamic hierarchical construct may be configured toreceive a data block from a parent node and distribute that data blockto at least two child nodes. The node may be configured to validate thedata block based on an upstream distribution path of the data block tothe top node. The dynamic hierarchical construct may be configured tochange the top node with each data block. Each of the plurality of nodesmay comprise a copy of the dynamic hierarchical construct.

The dynamic hierarchical construct may be based on a trusted scoreassigned to each node of the plurality of nodes. The parent node mayhave a higher trusted score than the node and the node may have a highertrusted score than each of the at least two child nodes. The node may beconfigured to validate the data block based on one or more trustedscores of one or more nodes in the upstream distribution path of thedata block. For example, trusted score assignment mechanisms aredescribed elsewhere herein.

Data may be distributed throughout the network according to a definedpath. The distribution path may follow a hierarchical paradigm accordingto a hierarchical construct such as a pyramidal construct. In somecases, the hierarchical construct may comprise or be a dynamichierarchical construct. The distribution path may be designed, adjusted,and optimized. Nodes may be assigned hierarchical levels according totest scores and/or additional factors. For example, a node which mayhave a higher (in some cases the highest) computation power compared tothe other nodes in the network and which may have spent a relativelylonger (in some cases the longest) time in the network may be determinedto be the top node in the network. In some cases, the top node may alsobe the top miner.

In some cases, the position of the top node may be altered or changedaccording to a defined mechanism, algorithm and/or approach. Forexample, in some cases, the position of the top node may change after aset time interval among a few other nodes which are at a top percentilein the hierarchical construct. As an example, the position of the topnode may change every 0.5 second (s) among the top 10% nodes. In otherexamples, the position of the top node may change every Δs second amongthe top p % nodes, where Δs may be from 0.01 s to 5 s, such as forexample 0.01 s, 0.05 s, 0.1 s, 0.15 s, 0.2 s, 0.25 s, 0.3 s, 0.35 s, 0.4s, 0.45 s, 0.5 s, 0.6 s, 0.7 s, 0.8 s, 0.9 s, 1 s, 2 s, 3 s, 5 s, orother time intervals, and p % may be for example, 1%, 2%, 3%, 4%, 5%,6%, 7%, 8%, 9%, 10%, 11%, 12%, 13%, 14%, 15%, 16%, 17%, 18%, 19%, 20%,25%, 30%, or other percentiles. In other examples, other time intervalsand percentiles may be applied.

For a block of transactions, a new random binary tree may be generatedwhich may determine or change the data distribution path in the network.This mechanism may make it more difficult for external entities topredict the path of data distribution and the position of the top nodein the network. In some cases, the distribution path may beunpredictable. This mechanism may introduce an unpredictabledistribution path and an unpredictable top node position every Δs secondfor the next cycle.

In some cases, external attackers may be unsuccessful to predict the topnode (e.g., the top miner) for the next cycle. An alternative strategyfor the potential external attacker may be to try to find and attack allsuspected top node positions, which may be too difficult and/orexpensive. Therefore, randomly changing the position of the top nodeamong a percentile of tope nodes at set time intervals may provide asecurity measure against external attacks.

Provided herein are methods for securing the database network systemagainst external attacks and other security risks which may comprisecomputation power analysis of the nodes to determine top node positions,loyalty to network (giving incentives to nodes which have spent moretime in the network), and quantum randomness (randomly changing theposition of the top node among a percentile of tope nodes at set timeintervals) according to the methods described herein. In some cases,data blocks may only be produced when activities such as transactions orother types of activities occur. Therefore, in some cases, empty blocksmay not occur or exist and/or may not freeze the trading of coins. Insome cases, double-spending problems may not be able to occur in thedatabase network system described herein.

The data block may comprise a cryptographic hash of a previous datablock in a blockchain network comprising the previous data block and thedata block. The node may be configured to further validate the datablock based on the cryptographic hash. The node may be configured todistribute the data block to at most two child nodes.

The data block may be signed by a user private key. The user private keymay be configured for verification by a user public key. The user publickey may be stored on a blockchain network. Each node of the plurality ofnodes may be configured to verify the user private key using the userpublic key.

In some cases, the data block may be signed by an application privatekey. The application private key may be configured for verification byan application public key. The application public key may be stored onthe blockchain network, and each node of the plurality of nodes may beconfigured to verify the application private key using the applicationpublic key.

The database network system may comprise a security mechanism or aplurality of security mechanisms to keep it secure against differentforms of attacks. Provided herein are security mechanisms to avoidproblems which may often be associated with decentralized networks. Insome examples, the database network system presented herein may be moresecure against different forms of attacks compared to other databasenetwork system, such as other decentralized networks, such as otherblockchain networks.

Common problems associated with decentralized networks may comprise arisk of undesired centralization of the decentralized network. Forexample, in some cases, the computer resources which may be needed toprocess larger amounts of data may become more expensive. As more usersmay incur more transactions, it may take longer for verification. Thismay reduce re operational efficiency gradually in the network. Exampleattacks and/or problems against the database network system may compriseforking attacks, double-spending problems, and/or other problems.Provided herein may be methods for reducing such risks and problems.Provided herein may be a consensus method for decentralized datadistribution which may be less vulnerable or substantially lessvulnerable, or in some cases, not significantly vulnerable, or notvulnerable to a forking attach, such as a 51% forking attack and/or adouble-spending problem.

Provided herein are security mechanisms to keep the database networksystem secure or substantially secure against attacks, risks and othertypes of problems. The database network system may comprise a consensusmethod. In some cases, the consensus method may comprise or be accordingto a hierarchical construct, such as a hierarchical construct describedherein, such as a quantum binary hierarchical construct describedherein, which may provide the benefit of making the database networksystem more secure against the common risks and problems associated withother decentralized networks. Such problems and risks may comprise 51%forking attacks, double-spending problems, and more.

For example, some decentralized networks, such as some proof-of-workblockchain networks may be vulnerable to forking attacks, such as 51%forking attack. In such networks, miners may need to voluntarily agreenot to exceed the 51% hash rate threshold, in order to maintain thetrust and value of the network. In some cases, bad actor nodes mayexist, which may for example mine empty blocks and/or may freeze tradingactivities of other nodes of the network in whole or in part. In somecases, bad actor nodes may freeze all the trading activities of theother nodes in the network. In some cases, bad actor nodes in suchnetworks may scheme a form of double spending by first presenting blocksand may later replace the presented blocks by empty blocks. In someinstances, a bad actor node may gain control over the network in wholeor in part, temporarily, for a short time, for a long time, orpermanently. In some cases, the bad actor advantage or the control ofthe bad actor over the network may be short-lived. For example, thenetwork's trust and value may break down and the network may getdestroyed.

In some cases, the hierarchical construct consensus described herein(such as the quantum pyramid consensus of the network presented herein)may be less vulnerable to or substantially less vulnerable to 51%forking attack. In some cases, the hierarchical construct consensusdescribed herein may not be vulnerable to 51% forking attack. In thehierarchical consensus presented herein, it may take time and loyaltyfor a node in the network to become the top node. The nodes in thenetwork may compete to become the top node by collective incentivesaccording to the methods described elsewhere herein, such as by takingcomputation power tests. In some cases, the ability of a node to getpromoted to a higher hierarchical level, and eventually become the topnode by replacing the current top nodes, may depend on both computationpower and the duration of time the node has spent in the network.Therefore, in some cases, a node may need both a relatively highcomputation power and loyalty to the network (based on time spent in thenetwork), in order to get promoted to a higher hierarchical level andeventually become the top node by replacing the current top node.

In some cases, a node's computation power as well as the time it hasspent in the network may contribute to determining whether such examplenode may be promoted to a higher position in the hierarchical network.In an example, if a given node happens to have double the computingpower of the current top node (or miner), and if the current top nodehas been in the top position for about 1 year, it may take that node 6months to replace the top node. Therefore, an example node which has ahigh computation power, but which has not been in the network for a longtime may not have built and/or demonstrated loyalty to the network andmay not be capable of replacing an example top node with a similar orlower computation power which has been in the network for a long time.Therefore, both the computation power and the duration of time a nodehas spent in the network may be accounted for when a node is to bepromoted to a higher hierarchical position in the network.

Provided herein are methods for keeping the database network systemsecure and in a functioning order even in case of a potential attack onthe system. For example, an attack on the system may occur, yet datadistribution in the network, and/or the activities and functions in thenetwork, such as transactions, may not be hindered. Each node may havethe network tree information. Therefore, in case of an attack, anexample node which has the network tree information may direct the blockof transaction to the next predetermined nodes. The network may keepfunctioning and distributing data, in some cases until the standing ofthe last node in the network.

The binary node-tree may provide clear decisions for the distribution ofdata in the network. For example, once a node becomes offline for anyreason, other nodes may still be active and functioning, and thedistribution of data blocks (e.g., transaction blocks in the network)may follow the next most effective path. The network may become moreresilient by increasing the number of the nodes, as more nodes may beavailable to be used as back up for others and each node may have thecomplete information of the network. Therefore, the network may becomemore secured and resilient.

Encryption and Double-Signing

Provided herein are methods for protecting a database network systemusing encryption. Encryption may comprise encoding data, information,documents, messages, or other forms of data and information in such away that only authorized parties may have access to it. Encryption maydeny the intelligible content to an example potential interceptor.Encryption may comprise an algorithm, such as an encryption algorithm.In some cases, information or data may be obtained only by authorizedparties. In some cases, data may be accessed only if decrypted such asby signing using a key, such as a user private key and/or a user publickey. In some cases, the encryption scheme may comprise using anencryption key. An encryption key may be generated by an algorithm. Theencryption key may be pseudo-random.

Encryption may comprise protecting the database network system providedherein or other networks using an encryption method which may comprisean encryption key and/or an algorithm. The method may compriseencrypting information regarding activities such as transactions takingplace in the network, through the network, and/or using the network. Themethod may comprise encrypting, hiding and/or obscuring the value and/orimportance, balance, spending, or any other information or dataregarding a certain activity taking place in the network (such as atransaction taking place in or through the network).

The database network system may comprise security methods. Securitymethods may keep the database network system secure against attacks,such as external attacks. The database network system described hereinmay be protected by different measures and procedures.

Security methods may comprise the use of public key cryptography. Publickey cryptography may comprise using a pair of a public key and a privatekey to perform different tasks. The pair of the public key and theprivate key may be referred to as keypair or a keypair signature. Publickeys may be widely distributed, while private keys may be kept secret.

In some cases, security methods may further comprise encryption anddouble-signing using a user private key and a public key. In some cases,security methods may further comprise double-signing using anapplication private key and an application public key. Provided hereinis an encryption scheme or method which may secure the system.

A public key (or signature) may be a random string of numbers. In somecases, the public key may be a long string of numbers which may seem orbe random. A public key may be an address on the database networksystem. Value tokens may be sent across the network and may be recordedas belonging to that address. A private key (e.g., a user private keyand/or an account password) (or signature) may function as a passwordthat gives its owner (user) access to their user account, digital assetsand/or otherwise authorize the user (owner of the account) to interactwith the various capabilities that the network may support, such as theapplications the network may support. For example, a first user may usea private key to digitally sign (or provide a digital signature on) anymessage or transaction. Another user (such as a second user) can takethe public key, which in some cases anyone on the network may know, andthe second user can use that to verify that the first user's private keywas the one that actually signed that message/transaction. The seconduser may be able to verify that the first user was the real person whocreated that message or who made that transaction.

In some cases, data stored on the network may be incorruptible and/orsubstantially incorruptible. For example, using a user's public key, itmay be possible to encrypt a message so that only an intended user withthe relevant private key may decrypt it and thereby read it. Using aprivate key, a digital signature can be created so that anyone with thecorresponding public key can verify that the message was created by theowner of the private key and may not have been modified since.Applications developed for the database network system and/or theblockchain database described herein may comprise an application privatekey and an application public key.

In some cases, signing with a private key and a public key alone may notbe sufficient to secure the database network system and additionalmeasures may also be applied. In some cases, the methods may furthercomprise using data encryption schemes provided herein as an additionalsecurity measure against data breach or other vulnerabilities. Theencryption scheme provided herein may provide security against the riskof exposing information regarding the balance and the spending of anaddress account, or content of other transaction activity, to thepublic. Encryption may comprise obscuring the address of the accountalong with additional security measures and features.

The encryption method provided herein may comprise double-signing.Double-signing may provide an additional security measure to keep thenetwork, the data blocks, and the applications safe and/or secure.Securing may comprise protecting against attack, hack, data breach,external manipulation, theft, or other types of attacks. In some cases,double-signing may comprise signing with a user private key, verifyingthe user private key, signing with an application private key, andverifying the application private key by the application public key.

In an example operation, the data block may be signed by a user privatekey. For example, a user may sign the data block using their privatekey. In some cases, the private key may be a password to a user account.In some cases, the user private key may be configured for verificationby a user public key. The user public key may be stored on the network.Each node of the plurality of nodes on the network may have the publickey or a copy of the public key of the user. Each node of the pluralityof nodes may be configured to verify the user private key using the userpublic key. Such verification may contribute to securing the databasenetwork system. The data block may be signed by an application privatekey, and the application private key may be configured for verificationby an application public key. The application public key may be storedon the database network system. Each node of the plurality of nodes mayhave a copy of the public key and may be configured to verify theapplication private key using the application public key. Suchverification may comprise or be an additional security layer for thenetwork, the data blocks, and the network applications and/or functions.

Alternatively, a data block may be signed by the user private key only.Alternatively, a data block may be signed by the application private keyonly.

For example, authorization of spending of an address account may requiredouble-signing of the transaction. In some cases, the spending may onlybe authorized if the transaction is double-signed.

In an example operation, a user may sign a transaction using a userprivate key. The user private key may be verified by each node on thenetwork using its public key. If the user private key is verified, thetransaction may proceed to further verification (e.g., by theapplication public key). If the user private key cannot be verified bythe nodes of the network using the public key, the transaction may notbe authorized, and the transaction may not proceed. In furtherverification schemes, an application private key (e.g., a private key ofa trusted application) may sign the same transaction. The applicationprivate key may be verified by each node on the network using theapplication public key (e.g., trusted application public key). Each nodeon the network may have a list of the public keys of the applications(e.g., trusted applications), and may use them to verify eachapplication private key as needed. If the application private key isverified by the application public key, the transaction may beauthorized, and the transaction may proceed. Alternatively, if theapplication private key cannot be verified by the application publickey, the transaction may not be authorized and may not proceed. Where atransaction is not authorized, decryption may not be completed, and theuser may not be authorized to perform the transaction.

In some cases, each trusted application may be like a contract, aprogram, or a major application. In some cases, trusted applications maybe executed on local devices and not on each node in the network. Thismay further decentralize the computing power.

Provided herein are methods for authentication. In some cases,authentication may comprise authentication with the key (or signature)of the user (such as signing by a user private key and/or an accountpassword), the signature of the application (such as signing by anapplication private key and/or an application public key and/or both),the signature of the top node (such as the private key of the top node),the signatures (keys and/or passcodes and/or passwords) of softwareupdates, and the signatures of new addresses, and combinations thereof.Authentication may further comprise one or more verification steps, suchas double-signing mechanisms, and more.

In some cases, each transaction of a user may be authenticated by theirkeypair signature (such as signing by private key and public keydescribed herein), and then may be verified by each node in thedecentralized network. The signature of a user's transaction (or anothermessage a user may send or create) may comprise the private key of thekeypair and the data of the transaction. Each node in the databasenetwork system may verify the signature by the public key of the keypairand the data of the transaction or the message sent or created. Eachnode may therefore verify a user's signature without knowing the user'sprivate key. Therefore, in some cases, the verifying nodes may not beable to intrude on the ownership of the users and/or the intent of thetransaction or the messages generated by that node. In some examples, nonode can counterfeit the signature even though a transaction is public.Therefore, in some cases, any document, or title deed, or financialtransaction can be authenticated by the user's signature without anyrisk of forgery.

Documents and financial transactions can also be encrypted to hide theirimportance and to be revealed only by the user's private key and that ofthe permissioned affiliates. A transaction that is authenticated by theuser's signature can be coupled not only with an encrypted documentinformation but also can optionally be coupled with a database action.The database action may be a part of the signature data verification. Adatabase of an address that references its transactions on theblockchain may open multiple applications to retrieve selectiveinformation and associations of that public address. That databaseaction may also be authenticated by the user's signature.

Other functionalities can optionally be activated or executed on eachnode in the similar way as that of a database action. Transactionauthentication may protect the ownership in in multiple transaction typeuse cases and may form a primary pillar of security on the blockchainsetup, such as the database network system described herein, theblockchain database, and/or both.

In some examples, authentication mechanisms may be implemented in theapplications. For example, the signature of an application can beverified by each node in the database network system and can establishtrust for an application. An example application can be tested by theusers over time to establish reliability and trust over time. A trustedapplication may generate a signature from the application's private key,and the transaction data can be distributed.

In some cases, one or more users or, in some cases, many users canexecute the trusted application that may be verified in the consensus ofthe nodes of the network. The application can hide its private keythrough calculations in its binary code. By putting the application incertain operating system environments, the application's private key canbe further secured.

In some examples, the security mechanism may further comprise anadditional measure to further hide the application private key. Forexample, the public key on each node used for authentication through theprevious private key signature can be dynamically and/or periodicallychanged. For example the public key on each node used for authenticationthrough the previous private key signature can be changed every Δseconds, such as every 0.01 s, 0.05 s, 0.1 s, 0.15 s, 0.2 s, 0.25 s, 0.3s, 0.35 s, 0.4 s, 0.45 s, 0.5 s, 0.6 s, 0.7 s, 0.8 s, 0.9 s, 1 s, 2 s, 3s, 5 s, or other time intervals. In some cases, this may also invalidateoutdated applications. So, a transaction double-signed by theapplication signature and the user signature may be authenticated forthe user's and the application's ownership for a transaction.

The authentication of the user's signature for information and databaseactions and the signature of an application may facilitate secure,inter-application data exchanges. Without user intervention,applications may be able to authorize structured data exchanges fromother applications.

The document platform (e.g., the document engine) and the blockchaindatabase may provide a base for complex structured data generation thatcan be exchanged between applications and/or software. Use cases cancomprise protocols for structured data exchange in the medical healthcare industry. For example, hospitals and other healthcare providerorganizations may have different computer systems used for everythingfrom billing records to patient tracking. In some cases, these systemscan communicate with each other (or “interface”) when they receive newinformation, or when they wish to retrieve information. The databasenetwork system, the blockchain database, and/or the document platform(e.g., document engine) provided herein may facilitate suchcommunications.

Other use cases may comprise processing orders, invoices, and statementsin multiple accounting systems. Examples may comprise replacing healthlevel seven (HL7), clinical document architecture (CDA), collaborativedrug discovery (CDD), or other protocols for structured data exchange inthe medical health care industry.

In some cases, the signatures of new addresses that can be verified byeach node in the decentralized network can control the creation of newaddresses and verify changes of the pseudo-name associated with eachaddress. The pseudo-name may simplify a user's transaction to the senderwithout the complexities of a 256-bit address number. The pseudo-namemay not have to identify the user. The user's signature may make it verydifficult, or, in some cases, not possible for other nodes to modify thepseudo-name associated with the user's public address.

In some examples, provided herein are device-specific methods. Forexample, the creation of new addresses can be controlled by using thedevice identifier (ID) and the user's password to generate the keypairof the user. In some cases, the user's transactions can only be sentfrom that specific device of the user. The device-specific method can beused without revealing the identity of the user. The authentication ofnew addresses may prevent the abuse of new address creations by others.

The signature of the top node in a block of transactions may be verifiedby each node in the decentralized network. This may establish thevalidity of the top node's creation of that block to the receivingnodes. Without the top node signature of the new block, any node in thenetwork may be able to create blocks of transactions and send it throughthe network. The top node's public address may be inherently known toall the member nodes of the network which may be used to verify each newblock in the blockchain (the database network system). The binary nodepath for a block through the network may also be signed by the top node.

The signature of the network software may be configured to be verifiedand/or to be updated by each node in the decentralized network. This mayestablish a controlled method to update the network's (the databasenetwork system or the blockchain network) software and may validate theownership of the software update. The network software may be considereda regular blockchain transaction with data that may be encrypted.Alternatively, the data may not be encrypted. The ownership of thenetwork software update transaction may be verified, and the node mayupdate its current network software with the data of the transaction forits further operations on the database network system (or theblockchain). This may integrate the software updates for the networkwith all the security features of the database network system.

Further provided is a blockchain repository system for software sourcecode with version control that can be private or open source. Theblockchain respiratory system may further comprise an option to downloadthe software applications.

Blockchain Database

The database network system may further comprise a database. Thedatabase may comprise a blockchain database. The blockchain database maystore information in data structures. In some cases, the data structuresmay comprise or be tables. In some examples, the data structures maycome in other shapes or forms.

Data may comprise any data of any type, format and structure. In somecases, data may be of critical importance. Data may compriseconfidential data. Data may need to be securely protected. Data maybelong to any entity such as any industry, any company, such as aninsurance company, a hospital, or a government entity.

The blockchain database provided herein may comprise an applicationprograming interface and may be used for developer applications. Variousprogramming and/or scripting languages may be used to develop newapplications, such as the described elsewhere herein. Variousprogramming languages and combinations thereof may be used to developapplications for the database network system and the blockchaindatabase.

Each node in the database network system may participate to provide datato the blockchain database. Each participant may maintain, calculate,and/or update new entries into the blockchain database. A plurality ofnodes (in some cases all nodes) may work together to ensure they come tothe same conclusions. This may provide in-built security to the databasenetwork system and the blockchain database.

The blockchain database may comprise a storage medium. The blockchaindatabase may further comprise a binary insert and search engine. In somecases, the blockchain database may comprise a storage medium, a binaryinsert and search engine. The binary building block may be presented asthe public side of the blockchain database and the storage medium may beprovided in private.

The storage medium may comprise any storage medium. The storage mediummay comprise memory, hard disk, SSD drive, or other types of harddrives, memory drives or devices. The storage medium may comprise acloud storage medium. The storage medium may comprise or be a blockchainsetup. The storage medium may comprise or be a blockchain storagemedium.

The blockchain database may comprise blockchain characteristics. Forexample, the blockchain database may comprise a storage mediumcomprising a blockchain setup or a blockchain storage medium. Theblockchain storage medium may comprise the features, structures, andsecurity methods described for the database network system presentedherein. For example, the blockchain storage medium may comprise datahashing according to the features and methods for the database networksystem provided herein. Data hashing may facilitate data integrityand/or decentralized data distribution. The blockchain storage mediummay comprise procedures and methods for encryption, signing and/ordouble-signing the data blocks or network applications by a user privatekey, a user public key, an application private key, and/or anapplication public key. The blockchain storage medium may comprisedecentralized data storage. Decentralized data storage may facilitateimmutability. For example, data may be immutable and transparent to allthe nodes. The blockchain storage medium described herein may compriseor be a platform for application computing (e.g., secure applicationcomputing). The blockchain database may inherently comprise all thefeatures described for the database network system.

In some examples, the blockchain database may comprise, be, and/orprovide an additional encryption layer to the database network system.In some cases, the blockchain database may comprise or be a secureback-end network data file system. The database network system describedherein may support the blockchain database and may comprise a front-endinterface.

The information in the blockchain database, such as the data in thedatabase and the database keys, such as a database private key and adatabase public key, may be stored on the database network system. Whenneeded, the information in the database (in some cases, all of theinformation in the database) may be capable of being restored from thedatabase network system, such as in case of data loss or damage for anyreason. This feature may provide an additional level of security andadditional independence.

In some cases, any entry in the blockchain database is signed. Forexample, any transaction entry in the blockchain database may be asigned transaction. Signing and/or double-signing transactions mayensure and/or authenticate ownership. Data on the database networksystem may be encrypted. Data encryption may enhance the security of thedatabase network system and the blockchain database. In some cases,every record of the blockchain database can become a transaction on thedatabase network system. Every record of the blockchain database may besaved as a piece of data on the database network system, and thereby bebacked up. The backed-up data may be restored if needed.

The blockchain database may comprise a fast platform for data storageand usage in a decentralized manner. The speed of the blockchaindatabase may be in a similar range as commercial databases. In somecases, the speed of the blockchain database provided herein may becomparable with a centralized database. Examples of commercial databasesmay comprise MSSQL, MySQL, SQLite, Oracle, and other databases. In somecases, the commercial databases may be centralized and not have theadvantages of decentralization. The blockchain database described hereinmay provide the advantages of decentralization and in some cases mayalso be more secure than commercial databases or other decentralizeddatabases (in some cases, without compromising speed).

In some cases, the blockchain database described herein may be suitableto be used in or with different forms of software. In some examples,software may be of critical importance. The blockchain database providedherein may be safely used along with such software, and the risks may beminimized using the security measures provided herein.

The database network system and the blockchain database provide hereinand/or the combined use of both may provide several advantages overconventional databases. They may provide ownership, security, anddecentralization to their uses. Central entities (e.g., corporations,governments, other entities) may be prevented from accessing privateuser data without permission and/or proper consent by using securitymechanisms such as data hashing and end-to-end encryption. Users maycreate and own their own data. Further, such decentralized systems maynot be reliant upon the operation of a single or few majors servers,wherein a problem in the operation of such one or few major servers mayprevent proper operation for extended periods of time and/or involvesignificant data loss.

The database network system and the blockchain database provided hereinmay comprise a hierarchical model (decentralized consensus algorithm)for decentralized data distribution. The hierarchical model, such as thedecentralized consensus algorithm of the blockchain database may providereal-time data back-up. In some cases, multiple operating copies of thedatabase network system and all the data stored in the database mayexist and/or be available. In some cases, the blockchain database mayensure real-time backups with multiple operating copies and data access.

The database network system may comprise data hashing. Data hashing mayprovide independence to the database network system and the blockchaindatabase. The decentralized distribution of data in the database networksystem may make it possible to recover potential lost data in case aproblem occurs. For example, if a node loses some of its data for somereason, such as a hardware failure, an external attack, or any otherreason, the node may regain its information and the full blockchainintegrity after a reboot. In some cases, corrupted data may be deleted.This may comprise comparing the data on the node which has lost some ofits data or has been damaged for any reason with the data hash availableon the other nodes on the database network system. The current state ofthe database network system (e.g., blockchain) may be updated on thementioned node. This process may stable the node's data integrity, insome cases with little intervention. Therefore, the information on theattacked or damaged node may be restored. The node may be stabilized.

In some cases, the blockchain database described herein may comprise alevel of integrity and/or immutability. In some cases, the level ofintegrity and/or immutability of the blockchain database may be similarto that of the database network system. The blockchain databasestructure may facilitate application development for software on thedatabase network system (e.g., blockchain). The database network systemdescribed here may be safe and secure. In some cases, new applicationscan be developed using the blockchain database presented herein. Inother examples, existing applications may re-interface their data accessmodules to that of the blockchain database described herein.

In some cases, the data source of the blockchain database may becompletely derived from the database network system, and therefore thestability and immutability of the blockchain database may besubstantially similar to that of the database network system. Thedatabase structure may be re-built from the data on the database networksystem (e.g., blockchain) when needed. In some cases, the database mayhave access to adjunction nodes. Alternatively, in some examples, thedatabase may not access adjunction nodes, or the use of adjunction nodesmay be optional.

In some cases, a particular address on the database network system maybe given a pseudo-name to mask the public address. The pseudo-name maybe used to acquire the public address of an account. In some cases, onlythe owner of the public address may be authorized to change thepseudo-name. This may decrease the probability of the pseudo-name to bemanipulated by a third-party. In some cases, the registration of a newpublic address on the database network system (e.g., the blockchain) maycomprise or be a signed (e.g., encrypted) transaction. In some cases, incase a node fails, the indexes associated with the blockchain addressesmay be re-built by the blockchain transaction data, such as the dataregarding the transactions taking place through the database networksystem which are available on the database network system. Using adjunctnodes to re-build and/or restore the data may be optional and, in somecases, data may be re-built without using adjunct nodes. Not usingadjunct nodes may have the benefit of stabilizing the surrounding indexstructures of the database network system (e.g., blockchain). In somecases, the surrounding index structures surrounding a node which mayneed to be repaired and the data of which may need to be restored and/orre-built may be stable. In some cases, the index and the databasestructure algorithms may be integrated using the methods and systemsdescribed herein (e.g., software) and may not depend on an externaldatabase to support them. In some cases, the database network system maysupport the blockchain database. In some cases, the blockchain databasemay support the database network system. In some cases, the databasenetwork system and the blockchain database may be integrated. In somecases, both the database network system and the blockchain database maysupport one another.

Multiple options may be added from a node's console to copy and updatethe database network system (e.g., the blockchain), to copy and updatethe database structures and address indexes, to copy and update thescore tree for node distribution, to start and register a new node, tomaintain and compare document and database files and/or folders, toregister new addresses and do transactions, and to monitor the state andstatistics of the database network system (e.g., blockchain). Thesefeatures may add to the stability of the independence of the nodes.

The systems and methods may provide secure and high-speed digitalcommunication and storage. Examples may include chat, secure email,secure photo sharing, secure web-page access, secure exchange ofdocuments and structured data, secure database applications, securestorage, and transfer of money.

Methods may comprise secure data structure exchange. In some cases, thesecure communication methods may be combined with a blockchain database,such as the blockchain database described herein, and present a securedata exchange method. Secure communication methods may comprise keypairauthentication, such as private key and public key signing according tothe methods described elsewhere herein. Secure communication methods mayfurther comprise user authentication, application authentication,database authentication, network, and software authentication. Each ofthese authentications may be performed according to the methods providedelsewhere herein. Secure communication methods may further compriseend-to-end encryption. Encryption methods may comprise encryptionmethods described anywhere herein. Secure communications may providedecentralized data distribution which may comprise immutability, globalprotocol, fast access, global database applications, a global database(such as the blockchain database provided herein), diverse applicationscalability, and security features described herein. Securecommunications may comprise data hashing. Data hashing may be accordingto the methods described for the database network system providedherein. Independence stability may be built in the nodes of the network(e.g., the database network system). Methods and systems may compriseself-maintenance, back-ups, data restoring mechanism in case of dataloss, and other features. In some cases, secure communications and/orsecure communication methods may comprise or have all the features,advantage, and/or benefits of the database network system providedherein. In some cases, secure communication methods may comprise or haveall the features, advantage, and/or benefits of the blockchain databasedescribed herein. In some cases, secure communication methods maycomprise or have all the features, advantage, and/or benefits of thedocument platform (e.g., the document engine) described herein. In somecases, secure communication methods may comprise the combined features,advantages, and/or benefits described for the database network system,the blockchain database, the document platform, and/or any combinationthereof.

Methods may comprise secure structured data exchange. Structured datamay be exchanged securely between a plurality of databases. Structureddata may be exchanged securely between databases in a manner similar tosecure document exchange between the nodes, addresses, or accountsthrough the database network system as provided herein. The methodsdescribed for data distribution across the nodes may also be used toexchange structured data between different databases. Databases maycomprise the blockchain database provided herein and other databases,such as commercial databases, conventional databases, centralizeddatabases, decentralized databases, blockchain databases, and/or anyother database and various combinations thereof. Structured databasesmay be exchanged among databases securely.

Decentralized data distribution may comprise distributing structureddata between two or more databases. The database network system maycomprise a plurality of nodes communicating in a hierarchical constructbased on a trusted score assigned to each node of the plurality ofnodes. In some cases, the database network system (e.g., the blockchainnetwork) may comprise a plurality of databases. The encryption methods,such as the double-signing method described elsewhere herein may befurther used to facilitate secure data exchange among two or moredatabases.

For example, a user may obtain a keypair to authenticate the exchange ofa message or a document to another user with its keypair access (privatekey and public key described herein). In the case of structured dataexchange, a database may obtain a keypair to exchange structured data toanother database that may have a keypair. The structured data may besigned, encrypted and written on the database network system (e.g.,blockchain) like any other message of document. The database entry mayalso be made pointing to the structured data on the blockchain. In somecases, the source of the structured data can be verified for acceptance.In some cases, a general mechanism for data exchange may also beproposed. Multiple data structure types may be accommodated over time.The secure standard mechanism of blockchain data exchange may beunaltered.

The secure structured data exchange between databases may giveapplications more independent freedom and may decrease unfavorable userintervention. Use cases may comprise medical document and data exchangebetween medical labs and also providers and repositories, monthlystatements that update the debtors' databases, inter-company andindustry structured data exchanges, and more.

The systems and methods described herein may provide decentralization offront-end user interfaces, as well as decentralization of logic and dataaccess. For example, in some examples, the read access of data may beenhanced by duplicating a node server's data to other node serversglobally. In some cases, the data read access may form a portion of anapplication's data access. In some cases, the front-end user interface(UI) and logic of applications may be distributed to the users' devices,such as user computers, personal computers (PCs), machines, or otherdevices. The data access of applications may be distributed anddecentralized on multiple servers. This may help establish independentand convenient (or affordable) participation of average nodes in dataentry, data distribution, and other activities using the databasenetwork system.

The methods and systems provided herein may provide an enhanced and/oran efficient data distribution path throughout the decentralized network(e.g., the data distribution path described for the database networksystem). The hierarchical construct of the database network system mayprovide a fast, efficient, and secure data distribution path in thedatabase network system, which may increase data write speed. In somecases, a large number of nodes which may be on the database networksystem may be provided with increased data write speeds and capacities.In some cases, the data write speeds of the nodes of the databasenetwork system may be limited by continental latencies. In some cases,continental latencies may be the only limitation to data write speeds.In some examples, data write speeds may be exponential. Exponential datawrite speeds may be facilitated by the data distribution paths in thedatabase network system provided herein.

In some cases, localized networks of node servers according to theapplication, interest, use cases, connectivity, and location of thenodes may further enhance the security and decentralization of the datadistribution. In some cases, localizing the networks of the node serversmay reduce the cost of data entry. Reduced costs of data entry mayfurther benefit the decentralization and the security of the databasenetwork system, the blockchain database, the document platform, and/orany combination thereof which may be used for various intents and/orapplications. In an example, a local network may communicate withanother local network through a connecting network (such as the databasenetwork system provided herein). This may introduce a local-globalnetwork.

The methods and systems provided herein may facilitate and/or benefituser freedom, such as freedom of speech. In some cases, the methods andsystems provided herein may not be susceptible to forking attacks. Insome cases, the methods and systems provided herein may comprise noinitial transaction distribution. In some cases, the database networksystem provided herein may not comprise a peer-to-peer network. In somecases, the methods and systems provided herein may be decentralized andthe chance of unfavorable centralization may be decreased.

Computer Systems

The present disclosure provides computer systems that are programmed toimplement methods of the disclosure. FIG. 2 shows a computer system 201that is programmed or otherwise configured to perform the methods of thepresent disclosure. For example, the computer system 201 may comprise orbe a node participating in the decentralized data distribution systemsand methods described herein. The computer system 201 can regulatevarious aspects of the present disclosure. The computer system 201 canbe an electronic device of a user or a computer system that is remotelylocated with respect to the electronic device. The electronic device canbe a mobile electronic device.

The computer system 201 includes a central processing unit (CPU, also“processor” and “computer processor” herein) 205, which can be a singlecore or multi core processor, or a plurality of processors for parallelprocessing. The computer system 201 also includes memory or memorylocation 210 (e.g., random-access memory, read-only memory, flashmemory), electronic storage unit 215 (e.g., hard disk), communicationinterface 220 (e.g., network adapter) for communicating with one or moreother systems, and peripheral devices 225, such as cache, other memory,data storage and/or electronic display adapters. The memory 210, storageunit 215, interface 220 and peripheral devices 225 are in communicationwith the CPU 205 through a communication bus (solid lines), such as amotherboard. The storage unit 215 can be a data storage unit (or datarepository) for storing data. The computer system 201 can be operativelycoupled to a computer network (“network”) 230 with the aid of thecommunication interface 220. The network 230 can be the Internet, aninternet and/or extranet, or an intranet and/or extranet that is incommunication with the Internet. The network 230 in some cases is atelecommunication and/or data network. The network 230 can include oneor more computer servers, which can enable distributed computing, suchas cloud computing. The network 230, in some cases with the aid of thecomputer system 201, can implement a peer-to-peer network, which mayenable devices coupled to the computer system 201 to behave as a clientor a server. The network 230, in some cases with the aid of the computersystem 201, can implement the database network system described herein.

The CPU 205 can execute a sequence of machine-readable instructions,which can be embodied in a program or software. The instructions may bestored in a memory location, such as the memory 210. The instructionscan be directed to the CPU 205, which can subsequently program orotherwise configure the CPU 205 to implement methods of the presentdisclosure. Examples of operations performed by the CPU 205 can includefetch, decode, execute, and writeback.

The CPU 205 can be part of a circuit, such as an integrated circuit. Oneor more other components of the system 201 can be included in thecircuit. In some cases, the circuit is an application specificintegrated circuit (ASIC).

The storage unit 215 can store files, such as drivers, libraries andsaved programs. The storage unit 215 can store user data, e.g., userpreferences and user programs. The computer system 201 in some cases caninclude one or more additional data storage units that are external tothe computer system 201, such as located on a remote server that is incommunication with the computer system 201 through an intranet or theInternet.

The computer system 201 can communicate with one or more remote computersystems through the network 230. For instance, the computer system 201can communicate with a remote computer system of a user (e.g.,operator). Examples of remote computer systems include personalcomputers (e.g., portable PC), slate or tablet PC's (e.g., Apple® iPad,Samsung® Galaxy Tab), telephones, Smart phones (e.g., Apple® iPhone,Android-enabled device, Blackberry®), or personal digital assistants.The user can access the computer system 201 via the network 230.

Methods as described herein can be implemented by way of machine (e.g.,computer processor) executable code stored on an electronic storagelocation of the computer system 201, such as, for example, on the memory210 or electronic storage unit 215. The machine executable ormachine-readable code can be provided in the form of software. Duringuse, the code can be executed by the processor 205. In some cases, thecode can be retrieved from the storage unit 215 and stored on the memory210 for ready access by the processor 205. In some situations, theelectronic storage unit 215 can be precluded, and machine-executableinstructions are stored on memory 210.

The code can be pre-compiled and configured for use with a machinehaving a processor adapted to execute the code or can be compiled duringruntime. The code can be supplied in a programming language that can beselected to enable the code to execute in a pre-compiled or as-compiledfashion.

Aspects of the systems and methods provided herein, such as the computersystem 201, can be embodied in programming. Various aspects of thetechnology may be thought of as “products” or “articles of manufacture”typically in the form of machine (or processor) executable code and/orassociated data that is carried on or embodied in a type of machinereadable medium. Machine-executable code can be stored on an electronicstorage unit, such as memory (e.g., read-only memory, random-accessmemory, flash memory) or a hard disk. “Storage” type media can includeany or all of the tangible memory of the computers, processors or thelike, or associated modules thereof, such as various semiconductormemories, tape drives, disk drives and the like, which may providenon-transitory storage at any time for the software programming. All orportions of the software may at times be communicated through theInternet or various other telecommunication networks. Suchcommunications, for example, may enable loading of the software from onecomputer or processor into another, for example, from a managementserver or host computer into the computer platform of an applicationserver. Thus, another type of media that may bear the software elementsincludes optical, electrical and electromagnetic waves, such as usedacross physical interfaces between local devices, through wired andoptical landline networks and over various air-links. The physicalelements that carry such waves, such as wired or wireless links, opticallinks or the like, also may be considered as media bearing the software.As used herein, unless restricted to non-transitory, tangible “storage”media, terms such as computer or machine “readable medium” refer to anymedium that participates in providing instructions to a processor forexecution.

Hence, a machine readable medium, such as computer-executable code, maytake many forms, including but not limited to, a tangible storagemedium, a carrier wave medium or physical transmission medium.Non-volatile storage media include, for example, optical or magneticdisks, such as any of the storage devices in any computer(s) or thelike, such as may be used to implement the databases, etc. shown in thedrawings. Volatile storage media include dynamic memory, such as mainmemory of such a computer platform. Tangible transmission media includecoaxial cables; copper wire and fiber optics, including the wires thatcomprise a bus within a computer system. Carrier-wave transmission mediamay take the form of electric or electromagnetic signals, or acoustic orlight waves such as those generated during radio frequency (RF) andinfrared (IR) data communications. Common forms of computer-readablemedia therefore include for example: a floppy disk, a flexible disk,hard disk, magnetic tape, any other magnetic medium, a CD-ROM, DVD orDVD-ROM, any other optical medium, punch cards paper tape, any otherphysical storage medium with patterns of holes, a RAM, a ROM, a PROM andEPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wavetransporting data or instructions, cables or links transporting such acarrier wave, or any other medium from which a computer may readprogramming code and/or data. Many of these forms of computer readablemedia may be involved in carrying one or more sequences of one or moreinstructions to a processor for execution.

The computer system 201 can include or be in communication with anelectronic display 935 that comprises a user interface (UI) 240 forproviding, for example, monitoring of sample preparation, monitoringdroplet preparation, monitoring reagent addition, monitoring ofreactions and/or reaction conditions, monitoring sequencing, results ofsequencing, and permitting user inputs for sample preparation, reaction,sequencing and/or analysis, etc. Examples of UIs include, withoutlimitation, a graphical user interface (GUI) and web-based userinterface.

Methods and systems of the present disclosure can be implemented by wayof one or more algorithms. An algorithm can be implemented by way ofsoftware upon execution by the central processing unit 205. Thealgorithm can, for example, implement sample preparation protocols,implement droplet preparation protocols, implement reagent additionprotocols, data analysis protocols, perform sequencing protocols, systemand/or device operation protocols, etc.

While preferred embodiments of the present invention have been shown anddescribed herein, it will be obvious to those skilled in the art thatsuch embodiments are provided by way of example only. It is not intendedthat the invention be limited by the specific examples provided withinthe specification. While the invention has been described with referenceto the aforementioned specification, the descriptions and illustrationsof the embodiments herein are not meant to be construed in a limitingsense. Numerous variations, changes, and substitutions will now occur tothose skilled in the art without departing from the invention.Furthermore, it shall be understood that all aspects of the inventionare not limited to the specific depictions, configurations or relativeproportions set forth herein which depend upon a variety of conditionsand variables. It should be understood that various alternatives to theembodiments of the invention described herein may be employed inpracticing the invention. It is therefore contemplated that theinvention shall also cover any such alternatives, modifications,variations or equivalents. It is intended that the following claimsdefine the scope of the invention and that methods and structures withinthe scope of these claims and their equivalents be covered thereby.

What is claimed is:
 1. A method for constructing a database networksystem from a plurality of nodes for decentralized data distribution,comprising: (a) using a plurality of tests, assaying a computing powerof each of said plurality of nodes substantially simultaneously, whereinsaid each of said plurality of nodes receives a different test of saidplurality of tests; (b) determining a test score for said each of saidplurality of nodes based at least in part on said computing powerdetermined in (a); (c) determining a trusted score for said each of saidplurality of nodes, wherein said trusted score is based at least in parton a sum of said test score and an accumulated trusted score for saideach of said plurality of nodes, if any; and (d) generating ahierarchical construct of said plurality of nodes, wherein a node ofsaid plurality of nodes in said hierarchical construct is configured toreceive a data block from a parent node and distribute said data blockto at least two child nodes, wherein said parent node has a highertrusted score than said node and wherein said node has a higher trustedscore than each of said at least two child nodes.
 2. The method of claim1, further comprising repeating (a)-(d), wherein said plurality of testsare calculated by said plurality of nodes, wherein two tests of saidplurality of tests provided to the at least two child nodes arecalculated by said node.
 3. The method of claim 1, wherein said trustedscore for said node is based at least in part on a given test score fora child node of said at least two child nodes.
 4. The method of claim 1,wherein said substantially simultaneously comprises less than 1 second.5. The method of claim 1, wherein said plurality of tests comprisescalculation of a total block hash based on random block numbers.
 6. Themethod of claim 1, further comprising distributing said data block fromsaid parent node to said node, and from said node to said at least twochild nodes.
 7. The method of claim 6, further comprising validatingsaid data block, by said each of said plurality of nodes, based on oneor more trusted scores of one or more nodes in an upstream distributionpath of said data block.